Efficient 3-SAT algorithms in the tile assembly model
نویسندگان
چکیده
منابع مشابه
Path finding in the tile assembly model
Swarm robotics, active self-assembly, and amorphous computing are fields that focus on designing systems of large numbers of small, simple components that can cooperate to complete complex tasks. Many of these systems are inspired by biological systems, and all attempt to use the simplest components and environments possible, while still being capable of achieving their goals. The canonical pro...
متن کاملImproving Efficiency of 3-SAT-Solving Tile Systems
The tile assembly model has allowed the study of the nature’s process of self-assembly and the development of self-assembling systems for solving complex computational problems. Research into this model has led to progress in two distinct classes of computational systems: Internet-sized distributed computation, such as software architectures for computational grids, and molecular computation, s...
متن کاملAlgorithms for Random 3-SAT
This classic problem in complexity theory is concerned with efficiently finding a satisfying assignment to a propositional formula. The input is a formula with n Boolean variables which is expressed as an AND of ORs with 3 variables in each OR clause (a 3-CNF formula). The goal is to (1) find an assignment of variables to TRUE and FALSE so that the formula has value TRUE, or (2) prove that no s...
متن کاملAbstract and Kinetic Tile Assembly Model
and Kinetic Tile Assembly Model In the following section I will explain the model behind the Xgrow simulator. I will first explain the aTAM model which is the basis of kTAM, and then I will explain the improvements in kTAM. The Abstract Tile Assembly Model (aTAM) was proposed by Erik Winfree as a practical variation on Wang tiling. Although the model generalizes to any number of dimensions, muc...
متن کاملArithmetic computation in the tile assembly model: Addition and multiplication
Formalized study of self-assembly has led to the definition of the tile assembly model [Erik Winfree, Algorithmic self-assembly of DNA, Ph.D. Thesis, Caltech, Pasadena, CA, June 1998; Paul Rothemund, Erik Winfree, The program-size complexity of selfassembled squares, in: ACM Symposium on Theory of Computing, STOC02, Montreal, Quebec, Canada, 2001, pp. 459–468]. Research has identified two issue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Natural Computing
سال: 2012
ISSN: 1567-7818,1572-9796
DOI: 10.1007/s11047-011-9299-0